Learning Restarting Automata by Genetic Algorithms
نویسنده
چکیده
Restarting automaton is a special type of a linear bounded automaton designed for modelling the so-called analysis by reduction. We use genetic algorithms to learn restarting automata to recognize languages according to input consisting of sets of positive and negative examples of words from the language together with positive and negative examples of simplifications.
منابع مشابه
Sequential and Mixed Genetic Algorithm and Learning Automata (SGALA, MGALA) for Feature Selection in QSAR
Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...
متن کاملSequential and Mixed Genetic Algorithm and Learning Automata (SGALA, MGALA) for Feature Selection in QSAR
Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...
متن کاملRelational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملLearning Analysis by Reduction from Positive Data
Analysis by reduction is a linguistically motivated method for checking correctness of a sentence. It can be modelled by restarting automata. In this paper we propose a method for learning of restarting automata which are strictly locally testable (SLT-R-automata). The method is based on the concept of identification in the limit from positive examples only. Also we characterize the class of la...
متن کاملRelations and Transductions Realized by Restarting Automata
In the present thesis we introduce several ways of extending restarting automata to devices for realizing binary (word) relations, which is mainly motivated by linguistics. In particular, we adapt the notion of input/output-relations and proper-relations to restarting automata and to parallel communicating systems of two restarting automata (PC-systems). Further, we introduce a new model, calle...
متن کامل